|
|
Location-aware data transfers scheduling for distributed virtual walkthrough applications.
Přibyl, Jaroslav ; Sochor, Jiří (referee) ; Sojka, Eduard (referee) ; Zemčík, Pavel (advisor)
Důležitou součástí aplikací procházení distribuovanou virtuální scénou je proces plánování přenosu dat. Jeho hlavním úkolem je zajištění efektivního přenosu dat a maximální kvality renderovaného obrazu. Největší vliv na kvalitu renderované scény mají omezení síťového připojení. Tyto omezení lze redukovat pomocí multi-resolution reprezentace dat scény, určováním priorit stahování jednotlivých částí scény, a přednačítáním dat. Pokročilé metody pro určování priorit a přednačítání částí scény jsou založeny na predikci pohybu uživatele vycházející z matematického popisu jeho pohybu. Tyto metody jsou schopny predikovat následující pozici uživatele jen v krátké vzdálenosti od jeho aktuální polohy. V případě náhlých, ale pravidelných změn směru pohybu uživatele jsou tyto metody nedostatečné co do přesnosti i délky predikce. V této práci je navrhnut komplexní přístup k řešení plánování přenosu dat splňující i tyto požadavky. Navrhované řešení využívá predikci pohybu uživatele založenou na znalostech k určení priority stahování dat i předstahování částí scény. Provedené experimenty nad testovacími daty ukazují, že navržené schéma plánování přenosu dat umožňuje dosažení vyšší efektivity přenosu dat a vyšší kvality renderovaného obrazu během průchodu testovací scénou.
|
|
|
Application for the Data Processing in the Area of Evolutionary Biology
Vogel, Ivan ; Burgetová, Ivana (referee) ; Očenášek, Pavel (advisor)
Phylogenetic tree inference is a very common method for visualising evolutionary relationships among species. This work focuses on explanation of mathematical theory behind molecular phylogenetics as well as design of a modified algorithm for phylogenetic tree inference based on intra-group analysis of nucleotide and amino acid sequences. Furthermore, it describes the object design and implementation of the proposed methods in Python language, as well as its integration into powerful bioinformatic portal. The proposed modified algorithmic solutions give better results comparing to standard methods, especially on the field of clustering of predefined groups. Finally, future work as well as an application of proposed methods to other fields of information technology are discussed.
|
|
|
Construction of Reliability Models for Advanced Digital Systems
Trávníček, Jan ; Drábek, Vladimír (referee) ; Kaštil, Jan (advisor)
This thesis deals with the systems reliability. At First, there is discussed the concept of reliability itself and its indicators, which can specifically express reliability. The second chapter describes the different kinds of reliability models for simple and complex systems. It further describes the basic methods for construction of reliability models. The fourth chapter is devoted to a very important Markov models. Markov models are very powerful and complex model for calculating the reliability of advanced systems. Their suitability is explained here for recovered systems, which may contain absorption states. The next chapter describes the standby redundancy. Discusses the advantages and disadvantages of static, dynamic and hybrid standby. There is described the influence of different load levels on the service life. The sixth chapter is devoted to the implementation, description of the application and description of the input file in XML format. There are discussed the results obtaining in experimental calculations.
|
|
|
Prediction in Projects using Markov Chains
Doležal, Jan ; Buřita, Ladislav (referee) ; Kreslíková, Jitka (referee) ; Lacko, Branislav (advisor)
This thesis is focused on possibilities of a project development prediction and a decision support for managers of those projects, which is an up to date topic in the present time turbulent environment. Project is understood as a stochastic process with discrete states and discrete time in this thesis. This approach could be represented by discrete moments of finding out project state. Project is compared to a finite automaton and Markovs chains are subsequently used. State model of the project based on Earned Value Management method is created in the proposal part of this thesis and there are state transitions probabilities. There are adjustments of the model designed consequently so the model is capable to fit some concrete situation closely. Designed proposals are tested in different situations to prove their value in the experimental part of this work.
|
|
|
Models of Queueing Systems
Horký, Miroslav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The master’s thesis solves models of queueing systems, which use the property of Markov chains. The queueing system is a system, where the objects enter into this system in random moments and require the service. This thesis solves specifically such models of queueing systems, in which the intervals between the objects incomings and service time have exponential distribution. In the theoretical part of the master’s thesis I deal with the topics stochastic process, queueing theory, classification of models and description of the models having Markovian property. In the practical part I describe realization and function of the program, which solves simulation of chosen model M/M/m. At the end I compare results which were calculated in analytic way and by simulation of the model M/M/m.
|
|
| |
|
|
Simulation of Spread of Infectious Diseases in Human Population
Křištof, Jiří ; Šimek, Václav (referee) ; Strnadel, Josef (advisor)
The aim of this work is to develop an epidemiological model to simulate the spread of the infectious disease covid-19. The developed SVLIHDRS model builds on compartmental models and is implemented as a Markov chain with continuous time. For the implementation, the UPPAAL tool is used. By comparing the simulation outputs with the observed data, the Spearman coefficients are 0.8940 for infectious individuals and 0.9987 for deceased individuals, the mean bias errors are 12510.7285 and 316.2697, respectively. The results of this thesis are useful for making long-term predictions of the epidemic evolution of covid-19 infection.
|
|
|
Tennis match modelling using Markov chains
Walica, Roman ; Hübnerová, Zuzana (referee) ; Hrabec, Pavel (advisor)
This thesis deals with the application of Markov chains in the tennis field and their subsequent adjustment based on formulated hypotheses. The first part of thesis describes the principles of the tennis game. In the second part, we deal with concepts from the field of statistics. These concepts are mainly used for creation and subsequent branching of Markov chains. The result of this work is several Markov chains for the game, divided by tennis serve or reception or by the type of surface on which the match is played. The other chains mentioned are chains for tiebreak, set and match. In final part of thesis we introduce obtained prediction of the result and the duration of the tennis match and its modeled parts.
|
|
|
Markov processes (analytic and probabilistic point of view)
Nováková, Eva ; Janák, Josef (advisor) ; Maslowski, Bohdan (referee)
This Bachelor Thesis tackles the basics of the Markov chains theory. The first four chapters describe fundamental definitions and theorems of the theory of Markov chains, both in continuous and discrete time and both with discrete and general state space. The last chapter contains examples of each type of Markov chains. The conclusion describes the relation between all four types of Markov chains.
|
|
|
Strong stationary times and convergence of Markov chains
Suk, Luboš ; Prokešová, Michaela (advisor) ; Kříž, Pavel (referee)
In this thesis we study the estimation of speed of convergence of Markov chains to their stacionary distributions. For that purpose we will use the method of strong stationary times. We focus on irreducible and aperiodic chains only since in that case the existence of exactly one stationary distribution is guaranteed. We introduce the mixing time for a Markov chain as the time needed for the marginal distribution of the chain to be sufficiently close to the stationary dis- tribution. The distance between two distributions is measured by the total variation distance. The main goal of this thesis is to construct an appropriate strong stationary time for selected chains and then use it for obtaining an upper bound for the mixing time.
|
guest ::
